C284r: Social Data Mining Lecture 1: Random Graphs
نویسنده
چکیده
Formally, when we are given a graph G and we say this is a random graph, we are wrong. A given graph is fixed, there is nothing random to it. What we mean though through this term abuse is that this graph was sampled out of a set of graphs according to a probability distribution. For instance, Figure 1.1 shows the three possible graphs on vertex set [3] = {1, 2, 3} with 2 edges. The probability distribution is the uniform, namely, each graph has the same probability 13 to be sampled.
منابع مشابه
0368 - 3248 - 01 - Algorithms in Data Mining Fall 2013 Lecture 4 : Home Assignment , Due Dec 3 rd
Warning: This note may contain typos and other inaccuracies which are usually discussed during class. Please do not cite this note as a reliable source. If you find mistakes, please inform me. 1 Probabilistic inequalities setup In this question you will be asked to derive the three most used probabilistic inequalities for a specific random variable. Let x 1 ,. .. , x n be independent {−1, 1} va...
متن کاملOn Solving the Maximum $k$-club Problem
Given a simple undirected graph G, the maximum k-club problem is to find a maximum-cardinality subset of nodes inducing a subgraph of diameter at most k in G. This NP-hard generalization of clique, originally introduced to model low diameter clusters in social networks, is of interest in network-based data mining and clustering applications. We give two MAX-SAT formulations of the problem and s...
متن کاملRandom Graph Models for Complex Systems
Graphs are a fundamental tool to model large complex systems such as the brain, the internet, social networks, or the world economy. Simple generative random graph models are therefore important for many areas of research. In applied computer science they are used to measure the performance of algorithms for web mining and distributed computing. In theoretical computer science they are used as ...
متن کاملBig Graph Mining: Frameworks and Techniques
Big graph mining is an important research area and it has attracted considerable attention. It allows to process, analyze, and extract meaningful information from large amounts of graph data. Big graph mining has been highly motivated not only by the tremendously increasing size of graphs but also by its huge number of applications. Such applications include bioinformatics, chemoinformatics and...
متن کاملContext Selection on Attributed Graphs for Outlier and Community Detection
English Version) Today’s applications store large amounts of complex data that combine information of different types. In particular, attributed graphs are an example for such a complex database. They are widely used for the representation of social networks, gene and protein interactions, communication networks or product co-purchase in web stores. Each object is characterized by its relations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014